A n2+n MQV key agreement protocol

In this paper, a novel scheme to generate (n 2 + n) common secret keys in one session is proposed, in which two parties can use them to encrypt and decrypt their communicated messages by using symmetric-key cryptosystem. The proposed scheme is based on the difficulty of calculating discrete logarithms problem. All the session keys can be used against the known key attacks, main-in-the middle attacks, replay attacks or forgery attacks. The security and efficiency of our proposed scheme are presented. Compare with other schemes, the proposed scheme can generate more session keys in one session. Therefore, the propose scheme is more efficient than the others.